ON THE TRUNCATED SMALL FUNCTION THEOREM IN NEVANLINNA THEORY

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Nevanlinna Theorem of the Classical Theory of Moments Revisited

The canonical solutions of the truncated Hamburger moment problem (both in the classical and degenerate cases) are found. The Nevanlinna theorem which provides the noncanonical solutions of the truncated Hamburger problem is also rederived in the framework of the operator approach.

متن کامل

Lectures on Nevanlinna theory

Value distribution of a rational function f is controlled by its degree d, which is the number of preimages of a generic point. If we denote by n(a) the number of solutions of the equation f(z) = a, counting multiplicity, in the complex plane C, then n(a) ≤ d for all a ∈ C with equality for all a with one exception, namely a = f(∞). The number of critical points of f in C, counting multiplicity...

متن کامل

The Error Term in Nevanlinna Theory. Ii

Nevanlinna theory [Ne] was created to give a quantitative measure of the value distribution for meromorphic functions, for instance to measure the extent to which they approximate a finite number of points. We view a meromorphic function as a holomorphic map ƒ : C —• P into the projective line. The theory has various higher dimensional analogues, of which we shall later consider maps ƒ : C —• X...

متن کامل

Nevanlinna theory for the difference operator

Certain estimates involving the derivative f 7→ f ′ of a meromorphic function play key roles in the construction and applications of classical Nevanlinna theory. The purpose of this study is to extend the usual Nevanlinna theory to a theory for the exact difference f 7→ ∆f = f(z+ c)− f(z). An a-point of a meromorphic function f is said to be c-paired at z ∈ C if f(z) = a = f(z+c) for a fixed co...

متن کامل

On the Truncated Kernel Function

p|n p is the well-known kernel function and P (n) is the largest prime factor of n. In particular, we show that the maximal order of γ2(n) for n ≤ x is (1 + o(1))x/ log x as x → ∞ and that ∑n≤x 1/γ2(n) = (1+ o(1))ηx/ log x, where η = ζ(2)ζ(3)/ζ(6). We further show that, given any positive real number u < 1, limx→∞ 1 x#{n ≤ x : γ2(n) < xu} = limx→∞ 1 x#{n ≤ x : n/P (n) < xu} = 1− ρ(1/(1− u)), wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Mathematics

سال: 2006

ISSN: 0129-167X,1793-6519

DOI: 10.1142/s0129167x06003540